Hilbert Basis Theorem 1 Jonathan Backer University of Alberta Edmonton Piotr Rudnicki University of Alberta Edmonton

نویسندگان

  • Jonathan Backer
  • Piotr Rudnicki
چکیده

One can prove the following propositions: (1) Let A, B be finite sequences and f be a function. Suppose rngA∪rngB ⊆ dom f. Then there exist finite sequences f1, f2 such that f1 = f · A and f2 = f · B and f · (A a B) = f1 a f2. (2) For every bag b of 0 holds decomp b = 〈〈∅, ∅〉〉. (3) For all natural numbers i, j and for every bag b of j such that i ¬ j holds b↾i is an element of Bags i. (4) Let i, j be sets, b1, b2 be bags of j, and b ′ 1 , b 2 be bags of i. If b 1 = b1↾i and b 2 = b2↾i and b1 divides b2, then b ′ 1 divides b 2 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Little Bezout Theorem ( Factor Theorem ) 1 Piotr Rudnicki University of Alberta Edmonton

We present a formalization of the factor theorem for univariate polynomials, also called the (little) Bezout theorem: Let r belong to a commutative ring L and p(x) be a polynomial over L. Then x− r divides p(x) iff p(r) = 0. We also prove some consequences of this theorem like that any non zero polynomial of degree n over an algebraically closed integral domain has n (non necessarily distinct) ...

متن کامل

Integrated step selection analysis: bridging the gap between resource selection and animal movement

Authors: 1. Tal Avgar, Department of Biological Sciences, University of Alberta, Edmonton, Alberta, Canada, T6G 2G1. 2. Jonathan R. Potts, School of Mathematics and Statistics, University of Sheffield, Sheffield, UK. 3. Mark A. Lewis, Department of Biological Sciences and Department of Mathematical and Statistical Sciences, University of Alberta, Edmonton, Alberta, Canada, T6G 2G1 4. Mark S. Bo...

متن کامل

Fundamental Theorem of Arithmetic 1 Artur Korniłowicz University of Białystok Piotr Rudnicki University of Alberta Edmonton

We follow the rules: a, b, n denote natural numbers, r denotes a real number, and f denotes a finite sequence of elements of R. Let X be an empty set. Observe that cardX is empty. One can check that every binary relation which is natural-yielding is also real-yielding. Let us mention that there exists a finite sequence which is natural-yielding. Let a be a non empty natural number and let b be ...

متن کامل

A new purification method for carbon nanotubes and associated atomic force microscope force–distance curve analysis

Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Alberta, Canada Department of Biomedical Engineering, University of Alberta, Edmonton, Alberta, Canada Department of Chemical and Materials Engineering, University of Alberta, Edmonton, Alberta, Canada Department of Mechanical Engineering, University of Alberta, Edmonton, Alberta, Canada National Institute for N...

متن کامل

A Survey and Experimental Comparison of Service Level Approximation Methods For Non-Stationary M/M/s Queueing Systems

School of Business, University of Alberta, Edmonton, Alberta T6G 2R6, Canada School of Business, University of Alberta, Edmonton, Alberta T6G 2R6, Canada School of Business, University of Alberta, Edmonton, Alberta T6G 2R6, Canada School of Business, University of Alberta, Edmonton, Alberta T6G 2R6, Canada Department of Computing Science, University of Alberta, Edmonton, Alberta, T6G 2R6, Canad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004